Scheduling CCRR tournaments
نویسندگان
چکیده
منابع مشابه
Scheduling Social Tournaments
The scheduling of social tournaments has attracted significant attention in recent years, as they arise in many practical applications and induce highly combinatorial problems. This research proposes a high-level modeling of social tournaments and a local search algorithm for finding solutions to the models. The effectiveness of the approach is demonstrated on three classes of applications: soc...
متن کاملScheduling social tournaments locally
Tournament scheduling, such as the social golfer problem, has attracted significant attention in recent years because of their highly symmetrical and combinatorial nature. This paper presents an effective local search algorithm for a variety of tournament scheduling problems, including social golfer problems, debating tournaments, judge assignments, and very social golfers. The algorithm finds ...
متن کاملScheduling asynchronous round-robin tournaments
We study the problem of scheduling asynchronous round-robin tournaments. We consider three measures of a schedule that concern the quality and fairness of a tournament. We show that the schedule generated by the well-known “circle design” performs well with respect to all three measures when the number of teams is even, but not when the number of teams is odd. We propose a different schedule th...
متن کاملScheduling Umpire Crews for Professional Tennis Tournaments
Professional tennis organizations, such as the United States Tennis Association (USTA), the Association of Tennis Professionals (ATP), the International Tennis Federation (ITF), and the Women’s Tennis Association (WTA), host tennis tournaments throughout the world. At these tournaments, chief umpires assign and schedule line umpires for every match. For most tournaments, they perform this task ...
متن کاملCentrum Voor Wiskunde En Informatica Scheduling Sport Tournaments Using Constraint Logic Programming Scheduling Sport Tournaments Using Constraint Logic Programming
We tackle the problem of scheduling the matches of a round robin tournament for a sport league. We formally deene the problem, state its computational complexity, and present a solution algorithm using a two-step approach. The rst step is the creation of a tournament pattern and is based on known graph-theoretic results. The second one is a constraint-based depth-rst branch and bound procedure ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2006
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2005.03.008